Tabulation of the Functions ^-7^- , v = ±è
نویسندگان
چکیده
(1) f ddK0(2zcosd) cos(2„É>) = -í/j_(*)Í.J,(«) + L(z) £-/-,(*)); Jo 4 ^ oV oV J where 7f0 denotes a modified Bessel function of the second kind. Oberhettinger [2] has previously discussed the degenerate cases dl„(z)/dv, v = ± §. The related problem of computing d«/„(z)/óV has been considered by Lee and Radosevich [3], who also present brief numerical tables. References to earlier work may be found in both of these papers. In the present paper we describe a tabulation of dl,(z)/dv to 4D, for v = ±|, and z = .01(.01)5.00. This should be adequate for calculations requiring moderate precision. An analytical error discussion of sufficient generality to cover extensions to higher precision and other values of v is also included. We append an abridgment of this table, corresponding to z = .01(.01)1.00(.05)5.00.
منابع مشابه
Acquiring molecular interference functions of X-ray coherent scattering for breast tissues by combination of simulation and experimental methods
Background: Recently, it has been indicated that X-ray coherent scatter from biological tissues can be used to access signature of tissue. Some scientists are interested in studying this effect to get early detection of breast cancer. Since experimental methods for optimization are time consuming and expensive, some scientists suggest using simulation. Monte Carlo (MC) codes are the best...
متن کاملThe Power of Two Choices with Simple Tabulation
The power of two choices is a classic paradigm used for assigning m balls to n bins. When placing a ball we pick two bins according to some hash functions h0 and h1, and place the ball in the least full bin. It was shown by Azar et al. [STOC’94] that for m “ Opnq with perfectly random hash functions this scheme yields a maximum load of lg lg n ` Op1q with high probability. The two-choice paradi...
متن کاملThe Italian domatic number of a digraph
An {em Italian dominating function} on a digraph $D$ with vertex set $V(D)$ is defined as a function$fcolon V(D)to {0, 1, 2}$ such that every vertex $vin V(D)$ with $f(v)=0$ has at least two in-neighborsassigned 1 under $f$ or one in-neighbor $w$ with $f(w)=2$. A set ${f_1,f_2,ldots,f_d}$ of distinctItalian dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vi...
متن کاملDouble Roman domination and domatic numbers of graphs
A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in cite{bhh} as a function$f:V(G)rightarrow{0,1,2,3}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least twoneighbors assigned 2 under $f$ or one neighbor $w$ with $f(w)=3$, and if $f(v)=1$, then the vertex $v$ must haveat least one neighbor $u$ with $f(u)ge 2$. The weight of a double R...
متن کامل